Deductive Systems for the Modal mu-Calculus
نویسنده
چکیده
We survey deductive systems for the modal μ-calculus. The distinguishing feature between different such systems is how minimality of least fixed points is guaranteed. There are basically three ways to achieve this: (i) by induction rules, (ii) by semi-formal rules with infinitely many premises, or (iii) by a global condition on infinitely long proof branches.
منابع مشابه
On the Proof Theory of the Modal mu-Calculus
We study the proof theoretic relationship between several deductive systems for the modal mu-calculus. This results in a completeness proof for a system that is suitable for deciding the validity problem of the mu-calculus. Moreover, this provides a new proof theoretic proof for the finite model property of the mu-calculus.
متن کاملSyntactic cut-elimination for a fragment of the modal mu-calculus
For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius [15] for LTL. More recent examples are the systems by the authors of this paper for the logic of common knowledge [5] and by Hill and Poggiolesi for PDL [8], which are based on a form of deep inference. These logics can be seen as fragments of the ...
متن کاملCompleteness for μ-calculi: a coalgebraic approach
We set up a generic framework for proving completeness results for variants of the modal mucalculus, using tools from coalgebraic modal logic. We illustrate the method by proving two new completeness results: for the graded mu-calculus (which is equivalent to monadic second-order logic on the class of unranked tree models), and for the monotone modal mu-calculus. Besides these main applications...
متن کاملPartial - Order Reduction in theWeak Modal Mu -
We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concur-rency Factory speciication and veriication environment; experimental results show that partial-order reduction can be highly eeective in combating state explosion in modal mu-calculus model c...
متن کاملSelective Mu-Calculus and Formula-Based Equivalence of Transition Systems
In model checking for temporal logic, the correctness of a system with respect to a desired behavior is verified by checking whether a structure that models the system satisfies a formula describing the behavior. Most existing verification techniques are based on a representation of the system by means of a labeled transition system. In this approach to verification, the efficiency of the model...
متن کامل